Planar Graphs with Many Perfect Matchings and Forests
نویسنده
چکیده
We determine the number of perfect matchings and forests in a family Tr,3 of triangulated prism graphs. These results show that the extremal number of perfect matchings in a planar graph with n vertices is bounded below by Ω ( 6 √ 7 + √ 37 n) = Ω (1.535) and the extremal number of forests contained in a planar graph with n vertices is bounded below by
منابع مشابه
Perfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملCounting Matchings with k Unmatched Vertices in Planar Graphs
We consider the problem of counting matchings in planar graphs. While perfect matchings in planar graphs can be counted by a classical polynomial-time algorithm [26, 33, 27], the problem of counting all matchings (possibly containing unmatched vertices, also known as defects) is known to be #P-complete on planar graphs [23]. To interpolate between the hard case of counting matchings and the eas...
متن کاملA superlinear bound on the number of perfect matchings in cubic bridgeless graphs
Lovász and Plummer conjectured in the 1970’s that cubic bridgeless graphs have exponentially many perfect matchings. This conjecture has been verified for bipartite graphs by Voorhoeve in 1979, and for planar graphs by Chudnovsky and Seymour in 2008, but in general only linear bounds are known. In this paper, we provide the first superlinear bound in the general case.
متن کاملCounting perfect matchings in graphs that exclude a single-crossing minor
A graph H is single-crossing if it can be drawn in the plane with at most one crossing. For any single-crossing graph H, we give an O(n4) time algorithm for counting perfect matchings in graphs excluding H as a minor. The runtime can be lowered to O(n1.5) when G excludes K5 or K3,3 as a minor. This is the first generalization of an algorithm for counting perfect matchings in K3,3free graphs (Li...
متن کاملCompatible Matchings for Bichromatic Plane Straight-line Graphs
Two plane graphs with the same vertex set are compatible if their union is again a plane graph. We consider bichromatic plane straight-line graphs with vertex set S consisting of the same number of red and blue points, and (perfect) matchings which are compatible to them. For several different classes C of graphs, we present lower and upper bounds such that any given graph G(S) ∈ C admits a com...
متن کامل